Extensible Buffer Management of Indexes
نویسندگان
چکیده
Most extensible database systems support addition of new indexes or new data types. However, the reference patterns exhibited by these new indexes may not be efficiently supported by existing buffer replacement strategies. In this paper, we propose a new mechanism that allows an index method to pass replacement hints to the buffer manager by assigning priority values to the buffer pages to reflect the desired replacement criteria. The proposed approach provides more flexible control over the replacement criteria as different semantics can be encoded using priority values which can also be changed dynamically. Buffer replacement thus becomes extensible since it is possible to customize a strategy to exploit lmowledge about the reference pattern of the application. This extensibility also facilitates the design and fine tuning of better replacement strategies. The approach is illustrated with a hierarchical index example. Experimental results show that a customized priority-based replacement strategy outperforms the commonly used LRU stra-
منابع مشابه
On the Index Selection Problem applied to Key oriented XML Indexes
In the world of Relational Database Management Systems (RDBMS) indexes are used to accelerate specific queries. The selection of indexes is an important task in database-tuning which is performed by a database administrator or an index selection tool which suggests a set of suitable indexes. In this paper we transfer the concept of specific indexes to XML Database Management Systems (XDBMS) and...
متن کاملReengineering a B-tree Implementation Using Design Patterns
Signiicant improvement in design quality is possible by using design patterns. We present the evolution of an implementation of a B-tree indexing system, which is a component in a database management system, in order to illustrate how design patterns clarify the design and make the design more extensible. The reengineering is a necessary step towards a reusable design and implementation for mul...
متن کاملOn the Integration of Structure Indexes and Inverted Lists
Several methods have been proposed to evaluate queries over a native XML DBMS, where the queries specify both path and keyword constraints. These broadly consist of graph traversal approaches, optimized with auxiliary structures known as structure indexes; and approaches based on information-retrieval style inverted lists. However, no published literature addresses methods of combining structur...
متن کاملMain-Memory Query Processing Utilizing External Indexes
Truong, T. 2016. Main-Memory Query Processing Utilizing External Indexes. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1352. 45 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9509-1. Many applications require storage and indexing of new kinds of data in main-memory, e.g. color histograms, textures, shape features, gene sequenc...
متن کاملTreeguide Index: Enabling Efficient XML Query Processing
XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML documents. In this paper, we first survey some of them and suggest a classification scheme. It appears that most techniques are indexing on paths in XML documents and maintain a separated index on values. In some cases, the...
متن کامل